Flexible multi-layer virtual machine design for virtual laboratory in distributed systems and grids.

We propose a flexible Multi-layer Virtual Machine (MVM) design intended to improve efficiencies in distributed and grid computing and to overcome the known current problems that exist within traditional virtual machine architectures and those used in distributed and grid systems. This thesis presents a novel approach to building a virtual laboratory to support e-science by adapting MVMs within the distributed systems and grids, thereby providing enhanced flexibility and reconfigurability by raising the level of abstraction. The MVM consists of three layers. They are OS-level VM, queue VMs, and components VMs. The group of MVMs provides the virtualized resources, virtualized networks, and reconfigurable components layer for virtual laboratories. We demonstrate how our reconfigurable virtual machine can allow software designers and developers to reuse parallel communication patterns. In our framework, the virtual machines can be created on-demand and their applications can be distributed at the source-code level, compiled and instantiated in runtime. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .K56. Source: Masters Abstracts International, Volume: 44-03, page: 1405. Thesis (M.Sc.)--University of Windsor (Canada), 2005

An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems

Rewriting modulo equations has been researched for several decades but due to the lack of suitable orderings, there are some limitations to rewriting modulo permutation equations. Given a finite set of permutation equations E, we present a new RPO-based ordering modulo E using (permutation) group actions and their associated orbits. It is an E-compatible reduction ordering on terms with the subterm property and is E-total on ground terms. We also present a completion and ground completion method for rewriting modulo a finite set of permutation equations E using our ordering modulo E. We show that our ground completion modulo E always admits a finite ground convergent (modulo E) rewrite system, which allows us to obtain the decidability of the word problem of ground theories modulo E

evidence from US commercial banks from 2003 to 2010

Thesis(Master) --KDI School:Master of Public Policy,2013masterpublishedDohan Kim

Equivalence of the Gelfand–Shilov Spaces

AbstractWe prove that there is a one to one correspondence between the Gelfand–Shilov spaceWMΩof typeWand the spaceSMpNpof generalized typeS. As an application we prove the equalityWM∩WΩ=WMΩ, which is a generalization of the equalitySr∩Ss=Srsfound by I. M. Gelfand and G. E. Shilov (“Generalized Functions, II, III,” Academic Press, New York/London, 1967)

Demi-linear Analysis III---Demi-distributions with Compact Support

A series of detailed quantitative results is established for the family of demi-distributions which is a large extension of the family of usual distributions

Stability regions of discrete linear periodic systems with delayed feedback controls

We propose a geometric method to determine the stability region of the zero solution of a linear periodic difference equation via the delayed feedback control (briefly, DFC) with the commuting feedback gain. For the equation, our method is more effective than the Jury criterion. First, we give a relationship, named the C-map theorem, between the characteristic multipliers of an original equation and those of the equation via DFC. Next, we show the existence and m-starlike property, defined in this paper, of an m-closed curve induced from the C-map. Using this result, we prove that the region enclosed by the m-closed curve is the stability region of the zero solution of the equation via DFC.Dohan Kim was supported by the National Research Foundation of Korea (NRF) grant funded by the Korean Government (MSIT) (No. 2018R1D1A1B07041273 and No. 2021R1A2C1092945